Single Axioms in the Implicational Propositional Calculus
نویسنده
چکیده
A class of challenge problems derived from a first-order encoding of the implicational propositional calculus is presented.
منابع مشابه
Functional Dependencies in a Relational Data Base and Propositional Logic
An equivalence is shown between functional dependency statements of a relational database, where “+” has the meaning of “determines,” and implicational statements of propositional logic, where “.$” has the meaning of “implies.” Specifically, it is shown that a dependency statement is a consequence of a set of dependency statements iff the corresponding implicational statement is a consequence o...
متن کاملAn Automated Derivation of Łukasiewicz's CN Sentential Calculus from Church's P2
Two logics are implicationally equivalent if the axioms and inference rules of each imply the axioms of the other. Characterizing the implicational equivalences of various formulations of the sentential calculi is foundational to the study of logic. Using an automated deduction system, I show that Łukasiewicz's CN sentential calculus can be derived from Church's P2; the proof appears to be novel.
متن کاملPrincipal Type-Schemes and Condensed Detachment
and introduction. The condensed detachment rule, or rule D, was first proposed by Carew Meredith in the 1950's for propositional logic based on implication. It is a combination of modus ponens with a "minimal" amount of substitution. We shall give a precise detailed statement of rule D. (Some attempts in the published literature to do this have been inaccurate.) The D-completeness question for ...
متن کاملProof complexity of intuitionistic implicational formulas
We study implicational formulas in the context of proof complexity of intuitionistic propositional logic (IPC). On the one hand, we give an efficient transformation of tautologies to implicational tautologies that preserves the lengths of intuitionistic extended Frege (EF ) or substitution Frege (SF ) proofs up to a polynomial. On the other hand, EF proofs in the implicational fragment of IPC p...
متن کاملHow many times do we need and assumption ?
In this article we present a class of formulas φn, n ∈ Nat, that need at least 2 assumptions to be proved in a normal proof in Natural Deduction for purely implicational minimal propositional logic. In purely implicational classical propositional logic, with Peirce’s rule, each φn is proved with only one assumption in Natural Deduction in a normal proof. Hence, the formulas φn have exponentiall...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1988